Optimal Traffic Engineering in Link State Routing Protocols
نویسندگان
چکیده
منابع مشابه
Link-State Routing Can Achieve Optimal Traffic Engineering
This paper settles a long-standing question with a positive answer: optimal traffic engineering can be realized using just link-state routing protocols. In conventional link-state protocols like OSPF and IS-IS, routers compute shortest paths based on link weights, splitting traffic evenly when multiple shortest paths exist. Unfortunately, in these particular cases of link-state protocols, compu...
متن کاملTraffic Engineering With Traditional IP Routing Protocols
Traffic engineering involves adapting the routing of traffic to the network conditions, with the joint goals of good user performance and efficient use of network resources. In this paper, we describe an approach to intradomain traffic engineering that works within the existing deployed base of Interior Gateway Protocols (IGPs), such as Open Shortest Path First (OSPF) and Intermediate System-In...
متن کاملSecurity issues in link state routing protocols for MANETs
In link state routing networks, every node has to construct a topological map through the generation and exchange of routing information. Nevertheless, if a node misbehaves then the connectivity in the network is compromised. The proactive Optimized Link State Routing (OLSR) protocol has been designed exclusively for Mobile Ad Hoc Networks (MANETs). The core of the protocol is the selection of ...
متن کاملCautious Weight Tuning for Link State Routing Protocols
Link state routing protocols are widely used for intradomain routing in the Internet. These protocols are simple to administer and automatically update paths between sources and destinations when the topology changes. However, finding link weights that optimize network performance for a given traffic scenario is computationally hard. The situation is even more complex when the traffic is uncert...
متن کاملLocal restoration algorithm for link-state routing protocols
Link-state protocols such as OSPF are the dominant routing technology in today’s Internet. Despite their many advantages, these protocols require the flooding of new information across the entire routing area after changes in any link state (e.g. link failures). As the routing area grows or the frequency of link-state changes increases, the overhead (in terms of bandwidth and processing cost) o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/11682-7341